منابع مشابه
Sublogarithmic Ambiguity
So far the least growth rate known for a divergent inherent ambiguity function was logarithmic. This paper shows that for each computable divergent total non-decreasing function f : N → N there is a context-free language L with a divergent inherent ambiguity function g below f . This proves that extremely slow growing divergent inherent ambiguity functions exist. For instance there is a context...
متن کاملSublogarithmic Searching without Multiplications
We show that a unit-cost RAM with word length w can maintain an ordered set of w-bit integers (or binary strings) under the operations search, insert, delete, nearest neighbour in O(p log n) worst-case time and range queries in O(p log n+size of output) worst-case time. The operations rely on AC 0 instructions only, thereby solving an open problem posed by Fredman and Willard. The data structur...
متن کاملThe Sublogarithmic Alternating Space World
{ the most stringent form of a bounded language { and still separate 2 Space(S) from 2 Space(S). Thus a separation of the rst level would require a syntatically more complex languages than the second level. For k > 2 the languages L k and L k used in this paper to establish the separation are no longer bounded. But by Proposition 4.1 the third level can also be separated using simple bounded la...
متن کاملUniversal Emulations with Sublogarithmic Slowdown
The existence of bounded degree networks which can emulate the computation of any bounded degree network of the same size with logarithmic slowdown is well-known. The butterfly is an example of such a universal network. Leiserson was the first to introduce the concept of an area-universal network: a network with VLSI layout area A which can emulate any network of the same size and layout area w...
متن کاملSublogarithmic uniform Boolean proof nets
Using a proofs-as-programs correspondence, Terui was able to compare two models of parallel computation: Boolean circuits and proof nets for multiplicative linear logic. Mogbil et. al. gave a logspace translation allowing us to compare their computational power as uniform complexity classes. This paper presents a novel translation in AC and focuses on a simpler restricted notion of uniform Bool...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.07.024